Some new equivalents of the Brouwer fixed point theorem
نویسندگان
چکیده
This is to recollect the equivalent formulations of Brouwer fixed point theorem. We collect a large number recently known sources such equivalents. More recently, Jinlu Li obtained two theorems on newly defined quasi-point-separable topological vector spaces. His extend Tychonoff theorem locally convex t.v.s. However, we note that his new are logically Consequently, add up our list
منابع مشابه
The Brouwer Fixed Point Theorem for Intervals1
(1) If a≤ c and d ≤ b, then [c,d]⊆ [a,b]. (2) If a≤ c and b≤ d and c≤ b, then [a,b]∪ [c,d] = [a,d]. (3) If a≤ c and b≤ d and c≤ b, then [a,b]∩ [c,d] = [c,b]. (4) For every subset A of R1 such that A = [a,b] holds A is closed. (5) If a≤ b, then [a, b]T is a closed subspace of R1. (6) If a≤ c and d ≤ b and c≤ d, then [c, d]T is a closed subspace of [a, b]T. (7) If a≤ c and b≤ d and c≤ b, then [a,...
متن کاملBrouwer Fixed Point Theorem for Simplexes
In this article we prove the Brouwer fixed point theorem for an arbitrary simplex which is the convex hull of its n + 1 affinely indepedent vertices of E. First we introduce the Lebesgue number, which for an arbitrary open cover of a compact metric space M is a positive real number so that any ball of about such radius must be completely contained in a member of the cover. Then we introduce the...
متن کاملSpherical Designs via Brouwer Fixed Point Theorem
For each N ≥ cdn 2d(d+1) d+2 we prove the existence of a spherical ndesign on Sd consisting of N points, where cd is a constant depending only on d.
متن کاملThe Game of Hex and the Brouwer Fixed-Point Theorem
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملComputable counter-examples to the Brouwer fixed-point theorem
This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and noncomputable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for finding the fixed point in general by giving an example of a computable function which does not fix any computable point. Research in reverse mathematics has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in the theory of nonlinear analysis and its applications
سال: 2022
ISSN: ['2587-2648']
DOI: https://doi.org/10.31197/atnaa.1086232